Applicative Abstract Categorial Grammars in Full Swing

نویسنده

  • Oleg Kiselyov
چکیده

Recently introduced Applicative Abstract Categorial Grammars (AACG) extend the Abstract Categorial Grammar (ACG) formalism to make it more suitable for semantic analyses while preserving all of its benefits for syntactic analyses. The surface form of a sentence, the abstract (tecto-) form, as well as the meaning are all uniformly represented in AACG as typed terms, or trees. The meaning of a sentence is obtained by applying to the abstract form a composition of elementary, deterministic but generally partial transformations. These term tree transformations are specified precisely and can be carried out mechanically. The rigor of AACG facilitates its straightforward implementation, in Coq, Haskell, Grammatical Framework, etc. We put AACG through its paces, illustrating its expressive power and positive as well as negative predictions on the wide range of analyses: gender-marked pronouns, quantifier ambiguity, scoping islands and binding, crossover, topicalization, and inverse linking. Most of these analyses have not been attempted for ACG. AACG offers a different perspective on linguistic side-effects, demonstrating compositionality not just of meanings but of transformations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applicative Abstract Categorial Grammars

We present the grammar/semantic formalism of Applicative Abstract Categorial Grammars (AACG), based on the recent techniques from functional programming: applicative functors, staged languages and typed final language embeddings. AACG is a generalization of Abstract Categorial Grammars (ACG), retaining the benefits of ACG as a grammar formalism and making it possible and convenient to express a...

متن کامل

S4 enriched multimodal categorial grammars are context-free

Bar-Hillel et al. [1] prove that applicative categorial grammars weakly recognize the context-free languages. Buszkowski [2] proves that grammars based on the product-free fragment of the non-associative Lambek calculus NL recognize exactly the contextfree languages. Kandulski [7] furthers this result by proving that grammars based on NL also recognize exactly the context-free languages. Jäger ...

متن کامل

The Categorial Annotation of Coordination in Arabic

The model of categorial grammars is a sufficiently flexible model to give an account of several languages and several forms of organisation of the linguistic units of these languages (coordination, subordination, etc). However, the research tasks were limited almost exclusively to European languages. A language like Arabic, in spite of the richness of the tradition of its schools of thought, wh...

متن کامل

Categorial Grammars, Combinatory Logic and the Korean Language Processing

In this paper we propose a new approach to Categorial Grammars based on Combinatory Logic to solve some syntactic and semantic problems in the Korean language processing. We handle particularly the problems of cases, free word order structure and coordination by developing a formalism of the extended Categorial Grammar that was originally introduced by J.-P. Desclés, and I. Biskri. We call this...

متن کامل

Korean Parsing Based on the Applicative Combinatory Categorial Grammar

The Applicative Combinatory Categorial Grammar (ACCG) is a new approach to Categorial Grammars by using exclusively the Combinatory Logic. This extended categorial grammar that was originally developed by J.-P. Desclés and I. Biskri, allows us to tackle the problem of the Korean language parsing in which there exist many difficulties from a computational point of view. In this paper, we handle ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015